The Uniform Generalized Decomposition Method for Generating Algebraic Expressions of Fibonacci Graphs
نویسندگان
چکیده
The paper investigates relationship between algebraic expressions and Fibonacci graphs (which give a generic example of non-series-parallel graphs). We propose the uniform generalized decomposition method for constructing Fibonacci graph expressions. On every step this method divides the graph of size n into k parts of the same size. We prove that to reach the smallest possible length of the corresponding algebraic expression the number k should be chosen equal to 2. When k is 2, the method generates expressions of ( ) 2 n O
منابع مشابه
On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the expressions of Fibonacci graphs and eventually find their shortest representations. With that end in view, we describe the optimal decomposition method for generati...
متن کاملOn Algebraic Expressions of Series-Parallel and Fibonacci Graphs
The paper investigates relationship between algebraic expressions and graphs. Through out the paper we consider two kinds of digraphs: series-parallel graphs and Fibonacci graphs (which give a generic example of non-series-parallel graphs). Motivated by the fact that the most compact expressions of series-parallel graphs are read-once formulae, and, thus, of O(n) length, we propose an algorithm...
متن کاملFibonacci Graphs and their Expressions
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the expressions of Fibonacci graphs and eventually find their shortest representations. With that end in view, we describe the number of methods for generating Fibonacc...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملA One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a square rhomboid that is an example of non-seriesparallel graphs. Our intention is to simplify the expressions of square rhomboids and eventually find their shortest representations. With that end in view, we describe the new algorithm for generating square rhomboid expressions, which imp...
متن کامل